WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(3)
  "0" :: [] -(0)-> "A"(5)
  "0" :: [] -(0)-> "A"(0)
  "bits" :: ["A"(5)] -(1)-> "A"(0)
  "half" :: ["A"(3)] -(1)-> "A"(5)
  "s" :: ["A"(3)] -(3)-> "A"(3)
  "s" :: ["A"(5)] -(5)-> "A"(5)
  "s" :: ["A"(0)] -(0)-> "A"(0)


Cost Free Signatures:
---------------------

  "0" :: [] -(0)-> "A"_cf(0)
  "bits" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "half" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "s" :: ["A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------